Lower Bounds on Data Collection Time in Sensory Networks
نویسندگان
چکیده
منابع مشابه
Lower Bounds on Data Collection Time in Sensor Networks
In this paper, we study the time complexity of data collection in sensor networks. A simple mathematical model for sensor networks regarded as lines, multi-lines and trees is defined and corresponding optimal schedules are provided. A lower bound of data collection time on general networks is also derived. Furthermore, we discuss the data collection problem where each node can transmit arbitrar...
متن کاملLower Bounds on Correction Networks
Correction networks are comparator networks that sort inputs differing from sorted sequences of length N in a small number of positions. The main application of such networks is producing fault-tolerant sorting networks. We show the lower bound 1.44log2 N on the depth of correction networks settling an open problem from [7]. This bound is tight since the upper bound 1.44log2 N is known.
متن کاملBisimulation on Speed: Lower Time Bounds
More than a decade ago, Moller and Tofts published their seminal work on relating processes, which are annotated with lower time bounds, with respect to speed. Their paper has left open many questions regarding the semantic theory for the suggested bisimulation– based faster–than preorder, the MT–preorder, which have not been addressed since. The encountered difficulties concern a general compo...
متن کاملComputing Time Lower Bounds for Recurrent Sigmoidal Neural Networks
Recurrent neural networks of analog units are computers for realvalued functions. We study the time complexity of real computation in general recurrent neural networks. These have sigmoidal, linear, and product units of unlimited order as nodes and no restrictions on the weights. For networks operating in discrete time, we exhibit a family of functions with arbitrarily high complexity, and we d...
متن کاملLower Bound Bayesian Networks - An Efficient Inference of Lower Bounds on Probability Distributions in Bayesian Networks
We present a new method to propagate lower bounds on conditional probability distributions in conventional Bayesian networks. Our method guarantees to provide outer approximations of the exact lower bounds. A key advantage is that we can use any available algorithms and tools for Bayesian networks in order to represent and infer lower bounds. This new method yields results that are provable exa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal on Selected Areas in Communications
سال: 2004
ISSN: 0733-8716
DOI: 10.1109/jsac.2004.830927